On-line reconstruction algorithms for the CBM and ALICE experiments

نویسنده

  • Sergey Gorbunov
چکیده

This thesis presents various algorithms which have been developed for on-line event reconstruction in the CBM experiment at GSI, Darmstadt and the ALICE experiment at CERN, Geneve. Despite the fact that the experiments are different — CBM is a fixed target experiment with forward geometry, while ALICE has a typical collider geometry — they share common aspects when reconstruction is concerned. The thesis describes: — general modifications to the Kalman filter method, which allows one to accelerate, to improve, and to simplify existing fit algorithms; — developed algorithms for track fit in CBM and ALICE experiment, including a new method for track extrapolation in non-homogeneous magnetic field. — developed algorithms for primary and secondary vertex fit in the both experiments. In particular, a new method of reconstruction of decayed particles is presented. — developed parallel algorithm for the on-line tracking in the CBM experiment. — developed parallel algorithm for the on-line tracking in High Level Trigger of the ALICE experiment. — the realisation of the track finders on modern hardware, such as SIMD CPU registers and GPU accelerators. All the presented methods have been developed by or with the direct participation of the author.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Oracle backend for AliEn

AliEn [1] is a lightweight GRID framework based on Perl, started by the ALICE offline Project at CERN. It constitutes the production environment for simulation, reconstruction and analysis of physics data of the ALICE Experiment. This middleware has been deployed by the experiments PANDA and CBM. As part of the facility, they will run their central services at GSI-FAIR. AliEn was originally dev...

متن کامل

Scientific and high-performance computing at FAIR

Future FAIR experiments have to deal with very high input rates, large track multiplicities, make full event reconstruction and selection on-line on a large dedicated computer farm equipped with heterogeneous many-core CPU/GPU compute nodes. To develop efficient and fast algorithms, which are optimized for parallel computations, is a challenge for the groups of experts dealing with the HPC comp...

متن کامل

Computational Challenges for the CBM Experiment

CBM (“Compressed Baryonic Matter”) is an experiment being prepared to operate at the future Facility for Anti-Proton and Ion Research (FAIR) in Darmstadt, Germany, from 2018 on. CBM will explore the high-density region of the QCD phase diagram by investigating nuclear collisions from 2 to 45 GeV beam energy per nucleon. Its main focus is the measurement of very rare probes (e.g. charmed hadrons...

متن کامل

A cost-oriented model for multi-manned assembly line balancing problem

In many real world assembly line systems which the work-piece is of large size more than one worker work on the same work-piece in each station. This type of assembly line is called multi-manned assembly line (MAL). In the classical multi-manned assembly line balancing problem (MALBP) the objective is to minimize the manpower needed to manufacture one product unit. Apart from the manpower, othe...

متن کامل

Estimation of LOS Rates for Target Tracking Problems using EKF and UKF Algorithms- a Comparative Study

One of the most important problem in target tracking is Line Of Sight (LOS) rate estimation for using from PN (proportional navigation) guidance law. This paper deals on estimation of position and LOS rates of target with respect to the pursuer from available noisy RF seeker and tracker measurements. Due to many important for exact estimation on tracking problems must target position and Line O...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013